<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>DGRv2: model/dgr-candidate-queue.h Source File</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr id="projectrow">
  <td id="projectalign">
   <div id="projectname">DGRv2<span id="projectnumber">&#160;2-dev</span>
   </div>
   <div id="projectbrief">A Delay-Guaranteed Routing Protocol model in ns-3</div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
  initMenu('../../',true,false,'search.php','Search');
  $(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('df/d86/dgr-candidate-queue_8h_source.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>

<div class="header">
  <div class="headertitle"><div class="title">dgr-candidate-queue.h</div></div>
</div><!--header-->
<div class="contents">
<a href="../../df/d86/dgr-candidate-queue_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno">    1</span><span class="comment">/* -*- Mode:C++; c-file-style:&quot;gnu&quot;; indent-tabs-mode:nil; -*- */</span></div>
<div class="line"><a id="l00002" name="l00002"></a><span class="lineno">    2</span><span class="comment">/*</span></div>
<div class="line"><a id="l00003" name="l00003"></a><span class="lineno">    3</span><span class="comment"> * Copyright 2007 University of Washington</span></div>
<div class="line"><a id="l00004" name="l00004"></a><span class="lineno">    4</span><span class="comment"> * </span></div>
<div class="line"><a id="l00005" name="l00005"></a><span class="lineno">    5</span><span class="comment"> * This program is free software; you can redistribute it and/or modify</span></div>
<div class="line"><a id="l00006" name="l00006"></a><span class="lineno">    6</span><span class="comment"> * it under the terms of the GNU General Public License version 2 as</span></div>
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno">    7</span><span class="comment"> * published by the Free Software Foundation;</span></div>
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno">    8</span><span class="comment"> *</span></div>
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno">    9</span><span class="comment"> * This program is distributed in the hope that it will be useful,</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno">   10</span><span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span></div>
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno">   11</span><span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span></div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno">   12</span><span class="comment"> * GNU General Public License for more details.</span></div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno">   13</span><span class="comment"> *</span></div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno">   14</span><span class="comment"> * You should have received a copy of the GNU General Public License</span></div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno">   15</span><span class="comment"> * along with this program; if not, write to the Free Software</span></div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno">   16</span><span class="comment"> * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA</span></div>
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno">   17</span><span class="comment"> *</span></div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno">   18</span><span class="comment"> * Author:  Craig Dowell (craigdo@ee.washington.edu)</span></div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno">   19</span><span class="comment"> */</span></div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno">   20</span> </div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno">   21</span><span class="preprocessor">#ifndef DGR_CANDIDATE_QUEUE_H</span></div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno">   22</span><span class="preprocessor">#define DGR_CANDIDATE_QUEUE_H</span></div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno">   23</span> </div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno">   24</span><span class="preprocessor">#include &lt;stdint.h&gt;</span></div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno">   25</span><span class="preprocessor">#include &lt;list&gt;</span></div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno">   26</span><span class="preprocessor">#include &quot;ns3/ipv4-address.h&quot;</span></div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno">   27</span> </div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno">   28</span><span class="keyword">namespace </span><a class="code hl_namespace" href="../../d7/d2e/namespacens3.html">ns3</a> {</div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno">   29</span> </div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno">   30</span><span class="keyword">class </span>DGRVertex;</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno">   31</span> </div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"><a class="line" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">   51</a></span><span class="keyword">class </span><a class="code hl_class" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">DGRCandidateQueue</a></div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno">   52</span>{</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno">   53</span><span class="keyword">public</span>:</div>
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno">   59</span>  <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8ce369fec28b2ef22fe68c3dca929476">DGRCandidateQueue</a> ();</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno">   60</span> </div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno">   67</span>  <span class="keyword">virtual</span> <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a781c132e67fec6534adb3e588e938034">~DGRCandidateQueue</a> ();</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno">   68</span> </div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno">   75</span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#adeeaf9c5c6e52bf6532da18cad7a1a13">Clear</a> (<span class="keywordtype">void</span>);</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno">   76</span> </div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno">   89</span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#ae02f69062ca21f025cba41d535491b87">Push</a> (<a class="code hl_class" href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">DGRVertex</a> *vNew);</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno">   90</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno">  101</span>  <a class="code hl_class" href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">DGRVertex</a>* <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a278c16f4c6de3e85aa9268215a6e95db">Pop</a> (<span class="keywordtype">void</span>);</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno">  102</span> </div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno">  114</span>  <a class="code hl_class" href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">DGRVertex</a>* <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a977476bb6142c7c0cb75af8c7fbc28cc">Top</a> (<span class="keywordtype">void</span>) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno">  115</span> </div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno">  121</span>  <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8fafbd85e0ef421b1660ad089997a8e1">Empty</a> (<span class="keywordtype">void</span>) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno">  122</span> </div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno">  130</span>  uint32_t <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#abdb46ac92a797d66c0a08f646f6637f5">Size</a> (<span class="keywordtype">void</span>) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno">  131</span> </div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno">  140</span>  <a class="code hl_class" href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">DGRVertex</a>* <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a0059b97ee38bc933def96f22719e90c8">Find</a> (<span class="keyword">const</span> Ipv4Address addr) <span class="keyword">const</span>;</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno">  141</span> </div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno">  155</span>  <span class="keywordtype">void</span> <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8745d6ce64bdbdc57e731025c7e78935">Reorder</a> (<span class="keywordtype">void</span>);</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno">  156</span> </div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno">  157</span><span class="keyword">private</span>:</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"><a class="line" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a2623d9840bbebaa9f73e9ab107c58c7c">  164</a></span>  <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a2623d9840bbebaa9f73e9ab107c58c7c">DGRCandidateQueue</a> (<a class="code hl_class" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">DGRCandidateQueue</a>&amp; sr);</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno">  165</span> </div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"><a class="line" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#ab3406cbdd8465b4dc741d75a92eae7ff">  173</a></span>  <a class="code hl_class" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">DGRCandidateQueue</a>&amp; <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#ab3406cbdd8465b4dc741d75a92eae7ff">operator= </a>(<a class="code hl_class" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">DGRCandidateQueue</a>&amp; sr);</div>
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno">  185</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#aff4da36dc33f48b29a1ac3cedaaca635">CompareDGRVertex</a> (<span class="keyword">const</span> <a class="code hl_class" href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">DGRVertex</a>* v1, <span class="keyword">const</span> <a class="code hl_class" href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">DGRVertex</a>* v2);</div>
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno">  186</span> </div>
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"><a class="line" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8e75c8bcd203b33ac721416e2640c59f">  187</a></span>  <span class="keyword">typedef</span> std::list&lt;DGRVertex*&gt; <a class="code hl_typedef" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8e75c8bcd203b33ac721416e2640c59f">DGRCandidateList_t</a>; </div>
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"><a class="line" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a2d91aa78fea568afa265cdbed2f214c4">  188</a></span>  <a class="code hl_typedef" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8e75c8bcd203b33ac721416e2640c59f">DGRCandidateList_t</a> <a class="code hl_variable" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a2d91aa78fea568afa265cdbed2f214c4">m_candidates</a>;  </div>
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno">  189</span> </div>
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno">  197</span>  <span class="keyword">friend</span> std::ostream&amp; <a class="code hl_friend" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a428325dcf2c8e3cf0886db75647b7795">operator&lt;&lt; </a>(std::ostream&amp; os, <span class="keyword">const</span> <a class="code hl_class" href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">DGRCandidateQueue</a>&amp; q);</div>
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno">  198</span>};</div>
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno">  199</span> </div>
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno">  200</span>} <span class="comment">// namespace ns3</span></div>
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno">  201</span> </div>
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno">  202</span><span class="preprocessor">#endif </span><span class="comment">/* DGR_CANDIDATE_QUEUE_H */</span><span class="preprocessor"></span></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html">ns3::DGRCandidateQueue</a></div><div class="ttdoc">A Candidate Queue used in routing calculations.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d86/dgr-candidate-queue_8h_source.html#l00051">dgr-candidate-queue.h:52</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a0059b97ee38bc933def96f22719e90c8"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a0059b97ee38bc933def96f22719e90c8">ns3::DGRCandidateQueue::Find</a></div><div class="ttdeci">DGRVertex * Find(const Ipv4Address addr) const</div><div class="ttdoc">Searches the Candidate Queue for a Shortest Path First Vertex pointer that points to a vertex having ...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00145">dgr-candidate-queue.cc:145</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a2623d9840bbebaa9f73e9ab107c58c7c"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a2623d9840bbebaa9f73e9ab107c58c7c">ns3::DGRCandidateQueue::DGRCandidateQueue</a></div><div class="ttdeci">DGRCandidateQueue(DGRCandidateQueue &amp;sr)</div><div class="ttdoc">Candidate Queue copy construction is disallowed (not implemented) to prevent the compiler from slippi...</div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a278c16f4c6de3e85aa9268215a6e95db"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a278c16f4c6de3e85aa9268215a6e95db">ns3::DGRCandidateQueue::Pop</a></div><div class="ttdeci">DGRVertex * Pop(void)</div><div class="ttdoc">Pop the Shortest Path First Vertex pointer at the top of the queue.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00105">dgr-candidate-queue.cc:105</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a2d91aa78fea568afa265cdbed2f214c4"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a2d91aa78fea568afa265cdbed2f214c4">ns3::DGRCandidateQueue::m_candidates</a></div><div class="ttdeci">DGRCandidateList_t m_candidates</div><div class="ttdoc">DGRVertex candidates.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d86/dgr-candidate-queue_8h_source.html#l00188">dgr-candidate-queue.h:188</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a428325dcf2c8e3cf0886db75647b7795"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a428325dcf2c8e3cf0886db75647b7795">ns3::DGRCandidateQueue::operator&lt;&lt;</a></div><div class="ttdeci">friend std::ostream &amp; operator&lt;&lt;(std::ostream &amp;os, const DGRCandidateQueue &amp;q)</div><div class="ttdoc">Stream insertion operator.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00049">dgr-candidate-queue.cc:50</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a781c132e67fec6534adb3e588e938034"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a781c132e67fec6534adb3e588e938034">ns3::DGRCandidateQueue::~DGRCandidateQueue</a></div><div class="ttdeci">virtual ~DGRCandidateQueue()</div><div class="ttdoc">Destroy an SPF Candidate Queue and release any resources held by the contents.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00074">dgr-candidate-queue.cc:74</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a8745d6ce64bdbdc57e731025c7e78935"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8745d6ce64bdbdc57e731025c7e78935">ns3::DGRCandidateQueue::Reorder</a></div><div class="ttdeci">void Reorder(void)</div><div class="ttdoc">Reorders the Candidate Queue according to the priority scheme.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00163">dgr-candidate-queue.cc:163</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a8ce369fec28b2ef22fe68c3dca929476"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8ce369fec28b2ef22fe68c3dca929476">ns3::DGRCandidateQueue::DGRCandidateQueue</a></div><div class="ttdeci">DGRCandidateQueue()</div><div class="ttdoc">Create an empty SPF Candidate Queue.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00068">dgr-candidate-queue.cc:68</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a8e75c8bcd203b33ac721416e2640c59f"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8e75c8bcd203b33ac721416e2640c59f">ns3::DGRCandidateQueue::DGRCandidateList_t</a></div><div class="ttdeci">std::list&lt; DGRVertex * &gt; DGRCandidateList_t</div><div class="ttdoc">container of DGRVertex pointers</div><div class="ttdef"><b>Definition</b> <a href="../../df/d86/dgr-candidate-queue_8h_source.html#l00187">dgr-candidate-queue.h:187</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a8fafbd85e0ef421b1660ad089997a8e1"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a8fafbd85e0ef421b1660ad089997a8e1">ns3::DGRCandidateQueue::Empty</a></div><div class="ttdeci">bool Empty(void) const</div><div class="ttdoc">Test the Candidate Queue to determine if it is empty.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00131">dgr-candidate-queue.cc:131</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_a977476bb6142c7c0cb75af8c7fbc28cc"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#a977476bb6142c7c0cb75af8c7fbc28cc">ns3::DGRCandidateQueue::Top</a></div><div class="ttdeci">DGRVertex * Top(void) const</div><div class="ttdoc">Return the Shortest Path First Vertex pointer at the top of the queue.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00119">dgr-candidate-queue.cc:119</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_ab3406cbdd8465b4dc741d75a92eae7ff"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#ab3406cbdd8465b4dc741d75a92eae7ff">ns3::DGRCandidateQueue::operator=</a></div><div class="ttdeci">DGRCandidateQueue &amp; operator=(DGRCandidateQueue &amp;sr)</div><div class="ttdoc">Candidate Queue assignment operator is disallowed (not implemented) to prevent the compiler from slip...</div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_abdb46ac92a797d66c0a08f646f6637f5"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#abdb46ac92a797d66c0a08f646f6637f5">ns3::DGRCandidateQueue::Size</a></div><div class="ttdeci">uint32_t Size(void) const</div><div class="ttdoc">Return the number of Shortest Path First Vertex pointers presently stored in the Candidate Queue.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00138">dgr-candidate-queue.cc:138</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_adeeaf9c5c6e52bf6532da18cad7a1a13"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#adeeaf9c5c6e52bf6532da18cad7a1a13">ns3::DGRCandidateQueue::Clear</a></div><div class="ttdeci">void Clear(void)</div><div class="ttdoc">Empty the Candidate Queue and release all of the resources associated with the Shortest Path First Ve...</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00081">dgr-candidate-queue.cc:81</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_ae02f69062ca21f025cba41d535491b87"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#ae02f69062ca21f025cba41d535491b87">ns3::DGRCandidateQueue::Push</a></div><div class="ttdeci">void Push(DGRVertex *vNew)</div><div class="ttdoc">Push a Shortest Path First Vertex pointer onto the queue according to the priority scheme.</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00093">dgr-candidate-queue.cc:93</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_candidate_queue_html_aff4da36dc33f48b29a1ac3cedaaca635"><div class="ttname"><a href="../../dd/d17/classns3_1_1_d_g_r_candidate_queue.html#aff4da36dc33f48b29a1ac3cedaaca635">ns3::DGRCandidateQueue::CompareDGRVertex</a></div><div class="ttdeci">static bool CompareDGRVertex(const DGRVertex *v1, const DGRVertex *v2)</div><div class="ttdoc">return true if v1 &lt; v2</div><div class="ttdef"><b>Definition</b> <a href="../../da/d53/dgr-candidate-queue_8cc_source.html#l00180">dgr-candidate-queue.cc:180</a></div></div>
<div class="ttc" id="aclassns3_1_1_d_g_r_vertex_html"><div class="ttname"><a href="../../dc/d43/classns3_1_1_d_g_r_vertex.html">ns3::DGRVertex</a></div><div class="ttdoc">Vertex used in shortest path first (SPF) computations.</div><div class="ttdef"><b>Definition</b> <a href="../../d5/d9c/dgr-route-manager-impl_8h_source.html#l00069">dgr-route-manager-impl.h:70</a></div></div>
<div class="ttc" id="anamespacens3_html"><div class="ttname"><a href="../../d7/d2e/namespacens3.html">ns3</a></div><div class="ttdef"><b>Definition</b> <a href="../../d5/d65/dgr-application-helper_8cc_source.html#l00027">dgr-application-helper.cc:27</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="../../dir_3f14f6767c31cb4a1d22c13c18cc6fc3.html">model</a></li><li class="navelem"><a class="el" href="../../df/d86/dgr-candidate-queue_8h.html">dgr-candidate-queue.h</a></li>
    <li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
  </ul>
</div>
</body>
</html>
